Remarks on Piecewise Polynomial Approximation

نویسنده

  • John R. Rice
چکیده

The theoretical and experimental background for the approximation of "real-world" functions is reviewed to motivate the use of piecewise polynomial approximations. It is possible in practice ~o achieve the results suggested by the theory for piecewise polynomials. A convergent adaptive algorithm is outlined which effectively and efficiently computes smooth piecewise polynomial approxImations to any member of a broad class of functions. This class includes all functions which are piecewise smooth and have a fini te number of "algebraic ll singularities. Theoretica.lly and experimentally determined properties of this algorithm are indicated. REMARKS ON PIECEWISE POLYNOMIAL APPROXIMATION * John R. Rice I. THE EXPERIMENTAL BACKGROUND. The advent of high speed computers made it both possible and necessary to compute approximations to a large variety of functions. The functions involved are somewhat arbitrarily divided into two classes: the mathematical functions (ex, rex), J1(x), etc.) and the "real world" functions (shape of a turbine blade or airplane wing, specific heat versus temperature for titanium, air pressure versus altitude, etc.) In this discussion we consider only the real-world functions and the remarks do not apply, in general, to the approximations of the elementary and special functions of mathematics. The experience of the 1950's was clear and convincing: classical linear methods of approximation are inadequate for real applications. We take ordinary polynomial approximations (say with L2 or L~ norms) as the prime example of these classical methods. Other methods involving trigonometric functions (Fourier Series), Bessel functions, etc. are no better. To make this position quantitative, we note that Rice made an experiment in the early 1960's as follows. Several dozen tabulated functions were selected at random from the rrHandbook of Chemistry and Physics" which represent a variety of relationships in the real world. All of the *This work was supported in part by grant GP 32940X from the National Science Foundation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on the Ciarlet-raviart Mixed Finite Element

Abstract. This paper derives a new scheme for the mixed finite element method for the biharmonic equation in which the flow function is approximated by piecewise quadratic polynomial and vortex function by piecewise linear polynomials. Assuming that the partition, with triangles as elements, is quasi-uniform, then the proposed scheme can achieve the approximation order that is observed by the C...

متن کامل

Approximation by C Splines on Piecewise Conic Domains

We develop a Hermite interpolation scheme and prove error bounds forC bivariate piecewise polynomial spaces of Argyris type vanishing on the boundary of curved domains enclosed by piecewise conics.

متن کامل

gH-differentiable of the 2th-order functions interpolating

Fuzzy Hermite interpolation of 5th degree generalizes Lagrange interpolation by fitting a polynomial to a function f that not only interpolates f at each knot but also interpolates two number of consecutive Generalized Hukuhara derivatives of f at each knot. The provided solution for the 5th degree fuzzy Hermite interpolation problem in this paper is based on cardinal basis functions linear com...

متن کامل

Close interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program

  The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We pro...

متن کامل

Nonlinear piecewise polynomial approximation: Theory and Algorithms

Nonlinear piecewise polynomial approximation: Theory and Algorithms Borislav Karaivanov We study nonlinear n-term approximation in Lp(R) (0 < p < ∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013